A Methodology for Redesigning Networks by Using Markov Random Fields
نویسندگان
چکیده
منابع مشابه
Loss networks and Markov random fields
This paper examines the connection between loss networks without controls and Markov random field theory. The approach taken yields insight into the structure and computation of network equilibrium distributions, and into the nature of spatial dependence in networks. In addition, it provides further insight into some commonly used approximations, enables the development of more refined approxim...
متن کاملA New Technique for Texture Classification Using Markov Random Fields
This paper proposes, applies and evaluates a new technique for texture classification in digital images. The work describes, as far as possible in a quantitative way, the concept of texture in digital images. Furthermore, we developed an innovative model that allows classifying and characterizing texture in digital images, to be used as a useful tool in noninvasive inspection of visual surfaces...
متن کاملMarkov Random Fields and Conditional Random Fields
Markov chains provided us with a way to model 1D objects such as contours probabilistically, in a way that led to nice, tractable computations. We now consider 2D Markov models. These are more powerful, but not as easy to compute with. In addition we will consider two additional issues. First, we will consider adding observations to our models. These observations are conditioned on the value of...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولMultiple-Motion-Estimation by Block-Matching Using Markov Random Fields
This paper deals with the problem of estimating multiple motions at points where these motions are overlaid. We present a new approach that is based on block-matching and can deal with both transparent motions and occlusions. We derive a block-matching constraint for an arbitrary number of moving layers. We use this constraint to design a hierarchical algorithm that can distinguish between the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: 2227-7390
DOI: 10.3390/math9121389